Space-filling Curve Generation: A Table-based Approach

نویسندگان

  • Guohua Jin
  • John M. Mellor-Crummey
چکیده

We introduce a table-based specification for spacefilling curves. This specification consists of a primitive curve representation and a movement specification table. We present an algorithm that uses these tables to enumerate points on a space-filling curve and discuss how to generate such tables automatically. Experimental results on three modern microprocessor based platforms show that our algorithm is up to 63% faster than the latest recursive algorithm for generating 2D curves and up to a factor of 66 faster than a previous byte-oriented, non-recursive implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach

A new parallel load distribution algorithm for unstructured parallel grid generation is presented. This new approach is based on a space-filling curve. The space-filling curve’s indices are calculated recursively and in parallel, thus leading to a very efficient, and fast load distribution. The partitions resulting from this distribution are simply connected and the processor boundaries are suf...

متن کامل

Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing...

متن کامل

Algebraic Formulation and Program Generation of Three-Dimensional Hilbert Space-Filling Curves

We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permutation which rearranges threedimensional n n n data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing a 3-D Hilbert space-filling curve. Th...

متن کامل

Using Space-filling Curves for Computation Reordering

Space-filling curves have been widely used in mathematics and to transform multi-dimensional problems into one-dimensional forms. For scientific applications, ordering data or computation along spacefilling curves can be useful for exploiting locality when partitioning onto parallel systems or when restructuring to exploit memory hierarchy. In this paper, we present an efficient approach for en...

متن کامل

Optimization of Numerically Controlled Five Axis Machining Using Curvilinear Space Filling Curves

The paper presents optimization and visualization methods for tool path planning of 5 axis milling machines. The first method is based on the grid generation techniques whereas the second method exploits the space filling curve technologies. Combination of the two techniques is superior with regard to the conventional methods and with regard to the case when the two methods are applied independ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005